NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
نویسندگان
چکیده
* A preliminary version of this paper appeared in ‘‘Proc. 2nd European Symposium on Ž . Ž . Algorithms ESA’94 pp. 424]435, Springer-Verlag, BerlinrNew York . † 4 E-mail: hunt,ravi,djr,res @cs.albany.edu. ‡ Supported by NSF Grant CCR-89-03319 and CCR-94-06611. § Supported by NSF Grant CCR-90-06396. ¶ E-mail: [email protected]. 5 Part of the work was done when the author was at SUNY, Albany. E-mail: marathe@ lanl.gov. Work supported by Department of Energy Contract W-7405-ENG-36.
منابع مشابه
Highly parallel approximations for inherently sequential problems
In this work we study classes of optimization problems that require inherently sequential algorithms to solve exactly but permit highly parallel algorithms for approximation solutions. NC is the class of computational problems decidable by a logarithmic space uniform family of Boolean circuits of bounded fan-in, polynomial size, and polylogarithmic depth. Such problems are considered both “effi...
متن کاملSokoban and Other Motion Planning Problems (extended Abstract)
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملSOKOBAN and other motion planning problems
We consider a natural family of motion planning problems with movable obstacles and obtain hardness results for them. Some members of the family are shown to be PSPACE-complete thus improving and extending (and also simplifying) a previous NP-hardness result of Wilfong. The family considered includes a motion planning problem which forms the basis of a popular computer game called SOKOBAN. The ...
متن کاملThe Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract)
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACEcomplete. We present polynomial time approximation algorithms for several standard PSPACE-hard problems considered in the literature. In contrast, we prove that finding -approximations for any > 0, for several other problems when the instances are s...
متن کاملPolynomial-Time Approximation Schemes for Geometric Intersection Graphs
A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomial-time approximation schemes (PTASs) for the maximum weight independent set problem (selecting disjoint disks of maximum total weight) and for the minimum weight vertex cover problem in disk graphs. These are the first known PTAS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 26 شماره
صفحات -
تاریخ انتشار 1998